Online Action Recognition with Margin-Based Query Learning
نویسندگان
چکیده
منابع مشابه
Query Learning with Large Margin Classi ersColin
The active selection of instances can sig-niicantly improve the generalisation performance of a learning machine. Large margin classiiers such as support vector machines classify data using the most informative instances (the support vectors). This makes them natural candidates for instance selection strategies. In this paper we propose an algorithm for the training of support vector machines u...
متن کاملOnline Action Recognition via Nonparametric Incremental Learning
We introduce an online action recognition system that can be combined with any set of frame-by-frame feature descriptors. Our system covers the frame feature space with classifiers whose distribution adapts to the hardness of locally approximating the Bayes optimal classifier. An efficient nearest neighbour search is used to find and combine the local classifiers that are closest to the frames ...
متن کاملHeterogeneous Face Recognition by Margin-Based Cross-Modality Metric Learning.
Heterogeneous face recognition deals with matching face images from different modalities or sources. The main challenge lies in cross-modal differences and variations and the goal is to make cross-modality separation among subjects. A margin-based cross-modality metric learning (MCM²L) method is proposed to address the problem. A cross-modality metric is defined in a common subspace where sampl...
متن کاملOnline Learning of Approximate Maximum Margin Classifiers with Biases
We consider online learning of linear classifiers which approximately maximize the 2-norm margin. Given a linearly separable sequence of instances, typical online learning algorithms such as Perceptron and its variants, map them into an augmented space with an extra dimension, so that those instances are separated by a linear classifier without a constant bias term. However, this mapping might ...
متن کاملOnline Learning of Maximum p-Norm Margin Classifiers with Bias
We propose a new online learning algorithm which provably approximates maximum margin classifiers with bias, where the margin is defined in terms of p-norm distance. Although learning of linear classifiers with bias can be reduced to learning of those without bias, the known reduction might lose the margin and slow down the convergence of online learning algorithms. Our algorithm, unlike previo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Robotics Society of Japan
سال: 2006
ISSN: 0289-1824,1884-7145
DOI: 10.7210/jrsj.24.861